Symmetric Replication for Structured Peer-to-Peer Systems
Identifieur interne : 001428 ( Main/Exploration ); précédent : 001427; suivant : 001429Symmetric Replication for Structured Peer-to-Peer Systems
Auteurs : Ali Ghodsi [Suède] ; Onana Alima [Suède] ; Seif Haridi [Suède]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions, successor-lists, or leaf-sets. We show that all three alternatives have limitations. We present and provide full algorithmic specification for a generic replication scheme called symmetric replication which only needs O(1) message for every join and leave operation to maintain any replication degree. The scheme is applicable to all existing structured peer-to-peer systems, and can be implemented on-top of any DHT. The scheme has been implemented in our DKS system, and is used to do load-balancing, end-to-end fault-tolerance, and to increase the security by using distributed voting. We outline an extension to the scheme, implemented in DKS, which adds routing proximity to reduce latencies. The scheme is particularly suitable for use with erasure codes, as it can be used to fetch a random subset of the replicas for decoding.
Url:
DOI: 10.1007/978-3-540-71661-7_7
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000970
- to stream Istex, to step Curation: 000784
- to stream Istex, to step Checkpoint: 000E28
- to stream Main, to step Merge: 001445
- to stream Main, to step Curation: 001428
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Symmetric Replication for Structured Peer-to-Peer Systems</title><author><name sortKey="Ghodsi, Ali" sort="Ghodsi, Ali" uniqKey="Ghodsi A" first="Ali" last="Ghodsi">Ali Ghodsi</name></author><author><name sortKey="Alima, Onana" sort="Alima, Onana" uniqKey="Alima O" first="Onana" last="Alima">Onana Alima</name></author><author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3A3A6386399EE0B06CAD63110D74E7B8D24F8585</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-71661-7_7</idno><idno type="url">https://api.istex.fr/document/3A3A6386399EE0B06CAD63110D74E7B8D24F8585/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000970</idno><idno type="wicri:Area/Istex/Curation">000784</idno><idno type="wicri:Area/Istex/Checkpoint">000E28</idno><idno type="wicri:doubleKey">0302-9743:2007:Ghodsi A:symmetric:replication:for</idno><idno type="wicri:Area/Main/Merge">001445</idno><idno type="wicri:Area/Main/Curation">001428</idno><idno type="wicri:Area/Main/Exploration">001428</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Symmetric Replication for Structured Peer-to-Peer Systems</title><author><name sortKey="Ghodsi, Ali" sort="Ghodsi, Ali" uniqKey="Ghodsi A" first="Ali" last="Ghodsi">Ali Ghodsi</name><affiliation><wicri:noCountry code="no comma">KTH/Royal Institute of Technology</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Alima, Onana" sort="Alima, Onana" uniqKey="Alima O" first="Onana" last="Alima">Onana Alima</name><affiliation><wicri:noCountry code="no comma">Swedish Institute of Computer Science (SICS)</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name><affiliation><wicri:noCountry code="no comma">KTH/Royal Institute of Technology</wicri:noCountry></affiliation><affiliation><wicri:noCountry code="no comma">Swedish Institute of Computer Science (SICS)</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">3A3A6386399EE0B06CAD63110D74E7B8D24F8585</idno><idno type="DOI">10.1007/978-3-540-71661-7_7</idno><idno type="ChapterID">Chap7</idno><idno type="ChapterID">7</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions, successor-lists, or leaf-sets. We show that all three alternatives have limitations. We present and provide full algorithmic specification for a generic replication scheme called symmetric replication which only needs O(1) message for every join and leave operation to maintain any replication degree. The scheme is applicable to all existing structured peer-to-peer systems, and can be implemented on-top of any DHT. The scheme has been implemented in our DKS system, and is used to do load-balancing, end-to-end fault-tolerance, and to increase the security by using distributed voting. We outline an extension to the scheme, implemented in DKS, which adds routing proximity to reduce latencies. The scheme is particularly suitable for use with erasure codes, as it can be used to fetch a random subset of the replicas for decoding.</div></front></TEI><affiliations><list><country><li>Suède</li></country></list><tree><country name="Suède"><noRegion><name sortKey="Ghodsi, Ali" sort="Ghodsi, Ali" uniqKey="Ghodsi A" first="Ali" last="Ghodsi">Ali Ghodsi</name></noRegion><name sortKey="Alima, Onana" sort="Alima, Onana" uniqKey="Alima O" first="Onana" last="Alima">Onana Alima</name><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001428 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001428 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3A3A6386399EE0B06CAD63110D74E7B8D24F8585
|texte= Symmetric Replication for Structured Peer-to-Peer Systems
}}
| This area was generated with Dilib version V0.6.20. |  |